Approximate compositions of a near identity map by multi-revolution Runge-Kutta methods
نویسندگان
چکیده
The so-called multi-revolution methods were introduced in celestial mechanics as an efficient tool for the long-term numerical integration of nearly periodic orbits of artificial satellites around the Earth. A multi-revolution method is an algorithm that approximates the map φNT of N near-periods T in terms of the one near-period map φT evaluated at few s ≪ N selected points. More generally, multi-revolution methods aim at approximating the composition φ of a near identity map φ. In this paper we give a general presentation and analysis of multi-revolution Runge-Kutta (MRRK) methods similar to the one developed by Butcher for standard Runge-Kutta methods applied to ordinary differential equations. Order conditions, simplifying assumptions, and order estimates of MRRK methods are given. MRRK methods preserving constant Poisson/symplectic structures and reversibility properties are characterized. The construction of high order MRRK methods is described based on some families of orthogonal polynomials.
منابع مشابه
University of Cambridge Numerical Analysis Reports Practical Symplectic Partitioned Runge{kutta and Runge{kutta{nystrr Om Methods Practical Symplectic Partitioned Runge{kutta and Runge{kutta{nystrr Om Methods
We present new symmetric fourth and sixth-order symplectic Partitioned Runge{ Kutta and Runge{Kutta{Nystrr om methods. We studied compositions using several extra stages, optimising the eeciency. An eeective error, E f , is deened and an extensive search is carried out using the extra parameters. The new methods have smaller values of E f than other methods found in the literature. When applied...
متن کاملAbstracts Keynote talks
A Runge–Kutta method takes small time steps, to approximate the solution to an initial value problem. How accurate is this approximation? If the error is asymptotically proportional to hp, where h is the stepsize, the Runge–Kutta method is said to have “order” p. To find p, write the exact solution, after a single time-step, as a Taylor series, and compare with the Taylor series for the approxi...
متن کاملApproximate Solution of the Second Order Initial Value Problem by Using Epsilon Modified Block-Pulse Function
The present work approaches the problem of achieving the approximate solution of the second order initial value problems (IVPs) via its conversion into a Volterra integral equation of the second kind (VIE2). Therefore, we initially solve the IVPs using Runge–Kutta of the forth–order method (RK), and then convert it into VIE2, and apply the εmodified block–pulse functions (εMBPFs) and their oper...
متن کاملNatural Continuous Extensions of Runge - Kutta Methods
The present paper develops a theory of Natural Continuous Extensions (NCEs) for the discrete approximate solution of an ODE given by a Runge-Kutta process. These NCEs are defined in such a way that the continuous solutions furnished by the one-step collocation methods are included.
متن کاملBlock Runge-Kutta Methods for the Numerical Integration of Initial Value Problems in Ordinary Differential Equations
Block Runge-Kutta formulae suitable for the approximate numerical integration of initial value problems for first order systems of ordinary differential equations are derived. Considered in detail are the problems of varying both order and stepsize automatically. This leads to a class of variable order block explicit Runge-Kutta formulae for the integration of nonstiff problems and a class of v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Numerische Mathematik
دوره 97 شماره
صفحات -
تاریخ انتشار 2004